Optimization of Sequences of XML Schema Modifications - The ROfEL Approach
نویسندگان
چکیده
The transformation language ELaX (Evolution Language for XML-Schema [16]) is a domain-specific language for modifying existing XML Schemas. ELaX was developed to express complex modifications by using add, delete and update statements. Additionally, it is used to consistently log all change operations specified by a user. In this paper we present the rule-based optimization algorithm ROfEL (Rule-based Optimizer for ELaX) for reducing the number of logged operations by identifying and removing unnecessary, redundant and also invalid modifications. This is an essential prerequisite for the co-evolution of XML Schemas and corresponding XML documents.
منابع مشابه
XML-Schemaevolution: Änderung eines XML-Schemas mit automatisierter Adaption assoziierter XML-Dokumente
The eXtensible Markup Language (XML) is a well-established and standardized format for exchanging and storing structured and semi-structured information. If the structure of an XML document complies with the standard of the W3C (World Wide Web Consortium), the XML document can be seen as well-defined. The XML Schema, abbreviated XSD (XML Schema Definition), is one schema language of the W3C for...
متن کاملXML Schema Transformations - The ELaX Approach
In this article the transformation language ELaX (Evolution Language for XML-Schema) for modifying existing XML Schemas is introduced. This domain-specific language was developed to fulfill the crucial need to handle modifications on an XML Schema and to express such modifications formally. The language has a readable, simple, basemodel-oriented syntax, but it is able to also express more compl...
متن کاملShifting Predicates to Inner Sub-expressions for XQuery Optimization
Besides XPath, XQuery is an XML query language developed by W3C. Within this paper, we present an approach for the optimization of the execution time of nested XQuery queries based on type information of the input XML document given in XML Schema. The optimization approach deletes unnecessary sub-expressions and shifts predicates to inner sub-expressions wherever possible in order to avoid the ...
متن کاملSemantic-based Optimal XML Schema Matching: A Mathematical Programming Approach
We propose a novel solution for semantic-based XML schema matching, taking a mathematical programming approach. This method identifies the globally optimal solution for the problem of matching two XML schemas by reducing the tree-to-tree matching problem to simpler problems of pathto-path, node-to-node, and word-to-word matching. We formulate these matching problems as maximum-weighted bipartit...
متن کاملRegular Expressions in Xml Schema Evolution
A data schema is a set of constructs that emulate relations between domain instances. Schema evolution is changes in the data schema and a system of data consistency support for such modifications. Axiomatic model regulates modifications and maintains data consistency by ensuring that the data schema always satisfies a set of axioms. This paper is an extension to previous work, which has define...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014